On Hard and Soft Decision Decoding of BCH Codes

نویسندگان

چکیده

The binary primitive BCH codes are cyclic and constructed by choosing a subset of the cyclotomic cosets. Which is chosen determines dimension, minimum distance weight distribution code. We construct possible determine their coderate, true non-equivalent codes. A particular choice cosets gives which are, extended one bit, equivalent to Reed-Muller codes, known result from sixties. show that have possibly better parameters than related in recent publications polar study decoding performance these different using information set based on minimal codewords dual even case channel without reliability since algorithm inherently calculates information. Different same rate compared performances complexity observed. Some examples hard decision as maximum likelihood decoding. All presented methods can be include Gaussian for soft simulation results list compare other methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum-likelihood soft decision decoding of BCH codes

The problem of efficient maximum-likelihood soft decision decoding of binary BCH codes is considered. It is known that those primitive BCH codes whose designed distance is one less than a power of two, contain subcodes of high dimension which consist of a direct sum of several identical codes. We show that the same kind of direct-sum structure exists in all the primitive BCH codes. as well as i...

متن کامل

A soft decision decoding of product BCH and Reed-Müller codes

Orthogonal Frequency Division Multiplexing (OFDM) is a very attractive modulation scheme for data transmission in multipath channels. But the high Peak-to-MEan Power Ratio (PMEPR) of the modulated signal is a major drawback and makes the use of some circuits very tricky : for instance, power amplifiers at the emission side could have nonlinear characteristics and a high PMEPR could exhibits int...

متن کامل

On the decoding of quasi-BCH codes

In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH and Reed-Solomon codes. This allows us to adapt the Welch-Berlekamp algorithm to quasi-BCH codes. In the second part of this paper we show that quasi-BCH codes can ...

متن کامل

Hard Decision and Soft Decision Decoding Algorithms for Ldpc and Qc-ldpc Codes

In this paper Hard Decision and Soft Decision decoding techniques for Quasi-Cyclic-Low Density Parity Check (QC-LDPC) code and Low Density Parity Check (LDPC) code is introduced. QC-LDPC code is proposed to reduce the complexity of the Low Density Parity Check code while obtaining the similar performance. The decoding processes of these codes are easy to simplify and implement. The algorithms u...

متن کامل

"Soft-decision" Decoding of Chinese Remainder Codes

Given n relatively prime integers p1 < · · · < pn and an integer k < n, the Chinese Remainder Code, CRTp1,...,pn;k, has as its message space M = {0, . . . , ∏k i=1 pi − 1}, and encodes a message m ∈ M as the vector 〈m1, . . . ,mn〉, where mi = m(mod pi). The soft-decision decoding problem for the Chinese remainder code is given as input a vector of residues ~r = 〈r1, . . . , rn〉, a vector of wei...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2022

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2022.3184168